24 research outputs found

    Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

    Full text link
    Due to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness. The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on optimisation problems that are actually a very simplified version of reality. This allows for the use of sophisticated approaches and guarantees in many cases that optimal solutions are obtained. Yet, the exclusion of real-world restrictions harms the applicability of those methods. What the industry needs are systems for optimised production scheduling that adjust exactly to the conditions in the production plant and that generates good solutions in very little time. This is exactly the objective in this thesis, that is, to treat more realistic scheduling problems and to help closing the gap between the literature and practice. The considered scheduling problem is called the hybrid flowshop problem, which consists in a set of jobs that flow through a number of production stages. At each of the stages, one of the machines that belong to the stage is visited. A series of restriction is considered that include the possibility to skip stages, non-eligible machines, precedence constraints, positive and negative time lags and sequence dependent setup times. In the literature, such a large number of restrictions has not been considered simultaneously before. Briefly, in this thesis a very realistic production scheduling problem is studied. Various optimisation methods are presented for the described scheduling problem. A mixed integer programming model is proposed, in order to obtaiUrlings ., T. (2010). Heuristics and metaheuristics for heavily constrained hybrid flowshop problems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/8439Palanci

    Study Protocol PROMETHEUS:Prospective Multicenter Study to Evaluate the Correlation Between Safety Margin and Local Recurrence After Thermal Ablation Using Image Co-registration in Patients with Hepatocellular Carcinoma

    Get PDF
    Purpose: The primary objective is to determine the minimal ablation margin required to achieve a local recurrence rate of 18 years with Barcelona Clinic Liver Cancer stage 0/A hepatocellular carcinoma (or B with a maximum of two lesions < 5 cm each) are eligible. Patients will undergo dual-phase contrast-enhanced computed tomography directly before and after ablation. Ablation margins will be quantitatively assessed using co-registration software, blinding assessors (i.e. two experienced radiologists) for outcome. Presence and location of recurrence are evaluated independently on follow-up scans by two other experienced radiologists, blinded for the quantitative margin analysis. A sample size of 189 tumors (~ 145 patients) is required to show with 80% power that the risk of local recurrence is confidently below 10%. A two-sided binomial z-test will be used to test the null hypothesis that the local recurrence rate is ≥ 10% for patients with a minimal ablation margin ≥ 2 mm. Logistic regression will be used to find the relationship between minimal ablation margins and local recurrence. Kaplan–Meier estimates are used to assess local and overall recurrence, disease-free and overall survival. Discussion: It is expected that this study will result in a clear understanding of the correlation between ablation margins and local recurrence. Using co-registration software in future patients undergoing ablation for hepatocellular carcinoma may improve intraprocedural evaluation of technical success. Trial registration The Netherlands Trial Register (NL9713), https://www.trialregister.nl/trial/9713

    Large-scale ICU data sharing for global collaboration: the first 1633 critically ill COVID-19 patients in the Dutch Data Warehouse

    Get PDF

    Shifting Representation Search for Hybrid Flexible Flowline Problems

    No full text
    info:eu-repo/semantics/publishe

    Local Search Engineering for Highly Constrained Hybrid Flow

    No full text
    info:eu-repo/semantics/publishe

    Shifting representation search for hybrid flexible flowline problems

    No full text
    This paper considers the hybrid flexible flowline scheduling problem with a set of additional restrictions and generalizations that are common in practice. These include precedence constraints, sequence dependent setup times, time lags, machine eligibility and release times. There are many potential solution representations for this problem, ranging from simple and compact, to more complex and complete. Typically, when choosing the degree of detail of the solution representation, a tradeoff can be found between efficiency of the algorithm and the size of the search space. Several adaptations of existing methods are introduced (memetic algorithm, iterated local search, iterated greedy), as well as a novel algorithm called shifting representation search (SRS). This new method starts with an iterated greedy algorithm applied to a permutation version of the problem and at a given time, switches to an iterated local search on the full search space. As far as we know, this shift of the solution representation is new in the scheduling literature. Experimental results and statistical tests clearly prove the superiority of SRS compared with classical and existing methods.Hybrid flexible flowline Realistic scheduling Precedence constraints Setup times Time lags Local search

    Efficient frontier analysis of Dutch public transport tendering: A first analysis

    No full text
    Dutch public transport provision has been competitively tendered out increasingly since 2001. Except for the Amsterdam city bus services, all bus transport in the country is carried out under a competitively tendered contact. Several evaluations have been carried out on the effects of competitive tendering in the Netherlands. Elsewhere we have seen stochastic frontier studies used to analyze the effects of governance changes. This paper carries out such a study for the Netherlands. In addition, the study expands the dataset with regional data as well as customer satisfaction and patronage data. This paper represents the first analysis of 10 percent of the concession years since 2001. It shows some unexpected outcomes, like tendering not bringing the higher efficiency expected. In addition, it also shows expected results, as the efficiency costs of quality incentives

    Catheter-directed thrombolysis versus percutaneous mechanical thrombectomy in the management of acute limb ischemia: a single center review

    No full text
    Abstract Background Acute limb ischemia is associated with significant mortality and amputation rate. Early restoration of flow can be obtained by various treatment methods that include catheter-directed thrombolysis (CDT) and percutaneous mechanical thrombectomy (PMT). These treatments have been shown to be effective but associated with various complications. There is lack of data comparing these two treatments. We aim to review our experience in the treatment of acute limb ischemia (ALI) and compare CDT with PMT. Results A total of 94 patients [mean age 65 years, 67% male (n = 63)] presented with ALI between 2006 and 2015 and were treated with either CDT or PMT. Outcomes were retrospectively reviewed. Primary outcomes were technical and clinical success; secondary outcomes were amputation rate at 30 days, duration of hospitalization and 30-day mortality. A total of 117 procedures were performed in 94 patients: 27 surgical bypass grafts, 31 previously stented arteries and 59 native vessels. Twenty eight procedures (24%) were performed with PMT, and 89 (76%) procedures were performed with CDT. Higher technical success was achieved in the PMT group (68%, 19/28) compared to the CDT group (47%, 42/89), p = 0.056. Clinical success was similar in both groups (75%, 21/28 in the PMT group and 73%, 65/89) in the CDT group (p = 0.837). There was no statistically significant difference in 30-day mortality between the PMT vs CDT groups (4% vs 8%, p = 0.425). The length of post-procedural hospital stay was shorter in patients with PMT (6.0 vs 12.6 days, p = 0.001). The absence of end-stage renal failure appears to be a predictor for clinical succes (HR 3.3, 95% CI 0.809–13.592). Conclusion PMT is associated with higher technical success and significantly shorter length of stay compared to CDT; however, clinical success is similar across both treatment entities. The safety profile is comparable
    corecore